Compositions colored by simplicial polytopic numbers
نویسندگان
چکیده
منابع مشابه
Compositions, Partitions, and Fibonacci Numbers
A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is provided.
متن کاملCanonical Ramsey numbers and properly colored cycles
We improve the previous bounds on the so-called unordered Canonical Ramsey numbers, introduced by Richer [D. Richer, Unordered canonical Ramsey numbers, Journal of Combinatorial Theory Series B 80 (2000) 172–177] as a variant of the canonical Ramsey numbers introduced by Erdős and Rado [P. Erdős, R. Rado, A combinatorial theorem, Journal of the London Mathematical Society 25 (4) (1950) 249–255]...
متن کاملOn compositions of numbers and graphs
The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of graphs i.e. a given graph compositions. The problems result from and are served in the entourage of series of exercises with hints based predominantly on Knop...
متن کامل3-colored Ramsey Numbers of Odd Cycles
Recently we determined the Ramsey Number r(C7, C7, C7) = 25. Let G = (V (G), E(G)) be an undirected finite graph without any loops or multiple edges, where V (G) denotes its vertex set and E(G) its edge set. In the following we will often consider the complete graph Kp on p vertices and the cycle Cp on p vertices. A k−coloring (F1, F2, . . . , Fk) of a graph G is a coloring of the edges of G wi...
متن کاملColored compositions, Invert operator and elegant compositions with the "black tie"
This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number of colored compositions for any coloration. The interesting consequences arising from this relationship also give an immediate and simple criterion to determ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2018
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2018.v9.n2.a1